REDAN: relative entropy-based dynamical allosteric network model
نویسندگان
چکیده
منابع مشابه
Quantum Dynamical Entropy from Relative entropy
In this exposition we prove an existence theorem for a quantum mechanical dynamical entropy based on von-Neumann’s measurement theory. To that end we introduced a Shannon type of information associated with a quantum channel or measurement based on Araki’s relative entropy. This is an invariance for the dynamics which generalizes Kolmogorov-Sinai ’s notion of dynamical entropy of a measure pres...
متن کاملRELATIVE INFORMATION FUNCTIONAL OF RELATIVE DYNAMICAL SYSTEMS
In this paper by use of mathematical modeling of an observer [14,15] the notion of relative information functional for relative dynamical systemson compact metric spaces is presented. We extract the information function ofan ergodic dynamical system (X,T) from the relative information of T fromthe view point of observer χX, where X denotes the base space of the system.We also generalize the in...
متن کاملMeasuring Dynamical Prediction Utility Using Relative Entropy
A new parameter of dynamical system predictability is introduced that measures the potential utility of predictions. It is shown that this parameter satisfies a generalized second law of thermodynamics in that for Markov processes utility declines monotonically to zero at very long forecast times. Expressions for the new parameter in the case of Gaussian prediction ensembles are derived and a u...
متن کاملEntropy operator for continuous dynamical systems of finite topological entropy
In this paper we introduce the concept of entropy operator for continuous systems of finite topological entropy. It is shown that it generates the Kolmogorov entropy as a special case. If $phi$ is invertible then the entropy operator is bounded with the topological entropy of $phi$ as its norm.
متن کاملRelative Network Entropy based Clustering Algorithm for Intrusion Detection
Clustering, as a kind of data mining methods, with the characteristic of no supervising, quick modeling is widely used in intrusion detection. However, most of the traditional clustering algorithms use a single data point as a calculating unit, and the drawback exists in time wasting to calculate one data point after another when clustering, meanwhile, a single local change of data will signifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Physics
سال: 2018
ISSN: 0026-8976,1362-3028
DOI: 10.1080/00268976.2018.1543904